556A - Case of the Zeros and Ones - CodeForces Solution


greedy *900

Please click on ads to support us..

Python Code:

n = int(input())
s = input()
ct0, ct1 = 0, 0
for i in range(len(s)):
    if s[i] == '0':
        ct0 += 1
    else:
        ct1 += 1

print(abs(ct0-ct1))

C++ Code:

#include<bits/stdc++.h>
using namespace std;

void solvio(){
    int n;
    cin >> n;
    string s;
    cin >> s;
    int one=0, zero=0;
    for(int i=0; i<s.size(); i++){
        if(s[i] == '0')zero++;
        else one++;
    }
    int mini = min(one, zero);
    cout << n-(2*mini) << endl;
}

int main(){
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

	ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
    solvio();
    return 0;
}


Comments

Submit
0 Comments
More Questions

339A - Helpful Maths
4A - Watermelon
476A - Dreamoon and Stairs
1409A - Yet Another Two Integers Problem
977A - Wrong Subtraction
263A - Beautiful Matrix
180C - Letter
151A - Soft Drinking
1352A - Sum of Round Numbers
281A - Word Capitalization
1646A - Square Counting
266A - Stones on the Table
61A - Ultra-Fast Mathematician
148A - Insomnia cure
1650A - Deletions of Two Adjacent Letters
1512A - Spy Detected
282A - Bit++
69A - Young Physicist
1651A - Playoff
734A - Anton and Danik
1300B - Assigning to Classes
1647A - Madoka and Math Dad
710A - King Moves
1131A - Sea Battle
118A - String Task
236A - Boy or Girl
271A - Beautiful Year
520B - Two Buttons
231A - Team
479C - Exams